Cosmic Ray Report
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0ce2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0cf0580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0ce0eb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea10e7040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0ce1870>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0fc2680>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0ce1270>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0f90880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0e72500>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0bdb070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0ce09a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0bef190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0d7ff10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea10e61d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0bdb640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0e73fd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0f93e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0e72b30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0f91000>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5ea0fb2ce0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f1ae740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f1b2ec0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f1acf40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f498850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f1afb20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f371150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f1ada50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f47e4a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f038b80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f373040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f5ca650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f3017e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f47f2b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f039000>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f0e18d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f5ca140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f2ada20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f303dc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f2ac5b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe86f384d30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee04a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee05d690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee0484c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee30ca00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee04aad0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee1c8190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee04b040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee2f1e40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33edeafd90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee43edd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33edf42860>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee2d8c70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee2223e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33edead180>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee43c280>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee2f3fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee222cb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee30c700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee222f50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f33ee1164a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047ae27a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047af0880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047ae3700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047da8bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047eda560>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d8c7c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047af0d30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d8ee90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047af1360>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047dbaa10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d8d840>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f10479ddc00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d74af0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047af01f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d74ac0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047ae1e10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d76e60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047ae19c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047d75ff0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1047ae0190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.55s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5a2e650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5a41d20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5935d20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5bb2d40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5937790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5e2e6e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5937e50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5a43100>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5935810>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5cc5e70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5e2ea10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5d0b700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5cc7250>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5935480>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5a2cbb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5935930>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb588b400>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5934190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb5cdc880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8fb59343a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018082740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f80180946d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018080610>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018354ca0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018081120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018228550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018082e30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f801822b8e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018081cf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018489c90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f801822b340>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018367310>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018263250>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018094ca0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8017f7ed40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018322ad0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8017f7e3b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8018097880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8017f7e5f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f801848af20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.53s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Sub, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" - str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeea9ada0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeeaac1f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeea9b340>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeeaad090>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeea990f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeeaaca90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeea99780>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeeac5b40>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeeb92950>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeebad6f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeed3add0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4eeeac7ac0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" - str(self.root)
E TypeError: unsupported operand type(s) for -: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb2740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb4220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb21d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c180bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c2b2aa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c160a30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb4880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c160070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb55d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759bf95870>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c1620e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759bdb6ec0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c14cdf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb5150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c14d840>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb2290>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c14fbb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb10c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759c14f9d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f759beb28f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedab6890>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedabae60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedab43a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1beded3040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedab4c40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedbb7fd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedab43d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedd86620>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedbc7100>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bed9d5690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedab79a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bed9ea0b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedad7010>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1beded2680>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bed9d63b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedbc5d20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedd84580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedbc6d70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedd867a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f1bedd9c6d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe196710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe1cc850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe195f00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe4788e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe5aeaa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe45d1e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe1cc0d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe45ee60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe1cd030>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe489840>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe45d780>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe0a3190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe445510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe1cc2b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe445de0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe194730>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe444c70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe1957b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe445690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f6ebe194520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.49s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5f3e6e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5f42f80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e71c60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b606c580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e73a90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b635a050>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e72fb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5f403a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e71450>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b61f5c00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b635ae30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b603d600>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b61f5120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e71f60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5f3d000>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e71cf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5dcaf80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e727a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b620c4f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f06b5e70c70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb950a710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb950c640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb95085e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb97d83a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb9509fc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb966fca0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb9509cc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb97bc220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb9378c40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb940f2e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb9508a00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb97dbbb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb96a70a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb9378100>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb96a6e00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb96c6200>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb96a4550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb940c8e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb95edc00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f3bb990a650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.49s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf9644a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96480220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf9644a1d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96724bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96856b30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96708a30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96480880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96708070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf964815d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96735870>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf9670a0e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf9635aec0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf966f0df0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf96481150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf966f1840>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf9644a290>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf966f3bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf964490c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf966f39d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7faf9644a8f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.53s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mul, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" * str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e1310520>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e16eee60>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e11e0070>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e11488e0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e16eebf0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e146a6e0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e14cb700>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e1468ca0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e15a9a50>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e13df640>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e15a8220>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fb1e13dd900>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" * str(self.root)
E TypeError: can't multiply sequence by non-int of type 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df0e740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df12e90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df0c430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e32afb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df0d180>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e00fe50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df0c3d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e1d94e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e002cb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6de2dfc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df0d7e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6de421a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6df2de10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e32af50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6de2ee60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e002170>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e1d92d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e002dd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e1dae30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5f6e1fa380>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c52710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c6d690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c51f00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136f348e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f713705ea10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136f111e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c6d510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136f12e60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c6e260>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136d41840>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136f11780>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136b63190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136ef9510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c6d120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136ef9de0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c50730>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136ef8c70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c517b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136ef9690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7136c50520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897d96740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897da8a60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897d96230>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0898068b80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897bf8850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897eab4c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897bf8e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f089819e7d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897bfbe50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897f2fbb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897c90910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f089819e890>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897f2e4a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897d95300>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897bfb580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0898079a20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897eaba00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0898079a80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0897f2f5b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f089807ba60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142ae740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142cc7f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142adf00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc514560e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc51468eb60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc51453c9a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc51468e230>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc51453eb60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc51468eec0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc514569150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142a3550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc51446abf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5140eb2e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142cc400>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc514194190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142cf760>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc514182770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5142cdc00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc514182350>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc5143c6830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.55s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd36740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd50670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd361d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffdca90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f50106a10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffb8790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd50130>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffbaa70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd513f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffe46a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffba4d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fc09d80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffa2b30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd51750>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffa36d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fdfe4a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4ffa0460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd36740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fd68640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6f4fdfcb80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020de6770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020de8790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020de43d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f00211e7040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020de5240>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020ec8fd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020de4430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f00210999f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020f0ad40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020ceb130>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020de6530>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020cfe1a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020df4850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f00211e6590>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020ceb430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020f0a170>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f002109b730>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0020f0ae30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0021098f70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f00210b6140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Div, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" / str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d2d70>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d41c0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d2020>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d7a90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d2620>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d7160>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d0a30>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5f03a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda889810>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda6e0ee0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda5d7d00>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f1cda718190>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" / str(self.root)
E TypeError: unsupported operand type(s) for /: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.40s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b39ee740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3a09450>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b39ee1d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3cd0a90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3dfa9b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3ca8790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3a095a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3ca9de0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3a09ea0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3addd50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3ca9480>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b38fdb40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3c95120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3a082e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3c954e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3afa380>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3c95090>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b39ed510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3ab8fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8b3af9c00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451ca2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451cb0640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451ca05b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451f68970>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451ca11b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451db8ee0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451ca1000>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451dbb010>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451ca1960>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451f7b8e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb45209a9b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451f7b040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451f4f7c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451cb0970>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451bb3c40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb45209ae00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451dba800>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451ca0520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451dbb6a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb451da98a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.57s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd092246710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0920c84f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd092247460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0923a0a00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0924d6a10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0923885e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0924d6e00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0923892d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0924d6350>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0924d6830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0921b58a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd091fd9de0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd091f44520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0920c9cc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd091fef820>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0920c07f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd091fedb70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0920c0e50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd091fedae0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd0923a3190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3bd65c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3be4610>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae1ae0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3d7c520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae3880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3e72170>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae3e50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3e70850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae1cc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3acf550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3db2890>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3fda470>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3bd5db0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3eb62f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae1f30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3bd7c10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae2f50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3bd6830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faad3ae0ac0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7be2830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7bf0760>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7be1d50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7fdac80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7be2bf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7ebbe50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7be1270>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7eba980>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7be15a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7a48250>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7eab400>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7c0a5f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7a49510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7add2d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7a491b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7c79570>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7bf1630>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7c7ba60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7bf1330>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc7f7be3a00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03926710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03960610>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03924670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03c083a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe039273a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03af99c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03925cc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03bec250>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03798be0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03837fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03924b20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03c0bb50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03a2e2f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03798100>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03a2db70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03acc700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03925cf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03af87c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03926ce0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe03bee530>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_FloorDiv, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" // str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d3478ae30>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34798220>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34699900>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34a4a4a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d3469b550>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d349478b0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34a35b10>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34944970>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34931b70>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d349478b0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34a34d30>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f5d34946830>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" // str(self.root)
E TypeError: unsupported operand type(s) for //: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f09e710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f0a0640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f09c550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f36c970>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f09d0f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f204f70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f09c430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f207520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f09da80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f1838b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f49e770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f1cc340>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f180c70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f0a07c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7efa02b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f205c00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f1cde70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f205660>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7f0ad7b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6c7ef0fa90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.52s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117c670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117a1d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce91444a00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9157a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9142cbe0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117c130>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9142ee30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117d3f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9125c9d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9142e260>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9107de10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce91416920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117d750>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce91416050>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce912aa0e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce91414af0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce9117a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce911538e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fce912a8b80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.53s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792692500>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f17926a1750>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792690eb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792a8e140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792691ba0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179296b640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792691150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179293d330>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179281edd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f17925831f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792691510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792595fc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179269add0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792a8eef0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f1792582a40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179281e620>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179293de70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179281ea40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179293c970>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f179295b1f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae2740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae4700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae0520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4dac910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae19c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4bcb5b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae1e40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4bcaa10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae1c60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4bc68c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ee2410>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4cad810>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4bc5150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae4820>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f49e5960>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4bc97e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f49e46a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4bca890>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae1db0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f39f4ae6650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf84266410>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf840c5f60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf844ea770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf840c76a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf844eae90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf84267dc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf844e9810>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8451e1d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf844eb520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8426b880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf840b05e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8451e6b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8434aec0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf844eb460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8434a1a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8465e920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf84534760>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf84265480>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8414d0c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fbf8429f040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37478c2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37478d0640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37478c05e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747b903a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37478c1fc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747a17dc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37478c1cc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747b74220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747720be0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37477bbc40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37478c0a00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747b93a60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37479ba2f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747720880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37479baf80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747a52800>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37479b8310>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f37477b8dc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747ba34c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3747cc6410>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Mod, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" % str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78b9ada0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78ba8a90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78f9eb90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78ba9b40>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78f9e170>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78ba8580>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78e6c430>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78d1dd80>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78d43970>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78a93940>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c789f9090>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f5c78aa66b0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" % str(self.root)
E TypeError: not all arguments converted during string formatting
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.40s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd99e710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd9b16f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd99e500>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc5b730>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdd92a10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc411e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd9b13f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc41660>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd9b2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc700d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc41750>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd895b70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc2edd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd9b2d70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc2c670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd99d240>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc2e830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd99dbd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bdc2c9d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94bd99c490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de62710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de66e30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de63700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536e148880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536e27e920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536e1304f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de67640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536e130070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de66dd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536df614b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de85ff0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536e27e7d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de61e40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de66e30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536de601f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536dfacd90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536e14b550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536dfade70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536dcec8e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536dfac1c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57432740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57444940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57430370>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe5782f010>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57431270>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe5770fa30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe574304c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe576e12a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe575f2d40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57333130>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57430790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe573462f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe574598d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe5782ea40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57332aa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe575f2140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe576e2d70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe575f17b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe576e30a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efe57433bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9802800>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9810970>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9801cc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9c06b30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9803040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9ae3790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9801e40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9ae2860>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9800940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e96601c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9ad0bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9828c40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9661300>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e96fa380>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9662b30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e9865780>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e98125f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e98679d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e98105b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f12e98002e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.53s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79afe650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79b10580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0dd50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79c82ce0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0f820>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79f068c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0ec20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79b11b40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0e980>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79d9e0b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79f062c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79de1ba0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79d9d060>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0e8c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79afca00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0c0d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79962e90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79a0c190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79db6980>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b79d9c640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.52s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c31e6e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c323340>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c31e5c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c73ab00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c31f8b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c41fe20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c31e620>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c23d480>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c252980>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c441570>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c323eb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c23d660>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c440fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c251060>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c41e6b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c4f7820>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c33fd30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c6052d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c5ef340>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2f8c251ed0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.52s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_Pow, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" ** str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55768eda0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5576a01f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55768f2e0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5576a0910>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55768da20>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5576a0c10>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55768d780>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55772e860>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5578127a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55780afe0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55792d270>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc55772ffa0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ** str(self.root)
E TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af86710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af94640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af86500>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b24f730>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b38aa70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b2351e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af94340>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b235660>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af954b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b266dd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b235750>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984ae7da80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b221000>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af95120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b2205e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af867d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b221720>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af85150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984b221420>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f984af84550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.52s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f758663a770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586648700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f758663a5c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586a32b60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f758663be20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75869133a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f758663a440>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75865357e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f758654a8c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75868117e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586648610>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75865375b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586810dc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586549d80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586912080>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75867f7340>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75868ebbb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75869035e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f75868ce6e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7586902770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.52s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae9a710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae9c5e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae99450>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8bab29a200>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae98d00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baaf7f9a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae98580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8bab14d270>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baafa2bf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baad9fdf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae98fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baadb0ca0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baaeaa3e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8bab29a710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baad9d3f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baafa2440>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8bab14e770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baafa12a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8bab14c820>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8baae98460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.53s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc85b2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc85b7160>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc85b30d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc8898ac0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc85b33d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc8775240>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc85b1390>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc8882410>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc843c6a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc89ce140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc84d2830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc886a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc872ec20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc843d270>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc84e4460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc843e3e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc84e5990>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc86f8dc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc872dd80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cc85d1f90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.49s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddeb6710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddebf010>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddeb6020>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde19c910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde2d2f20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde184880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde2d2e60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde184bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde2d2140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde2d2590>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddfbd7b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ddddd6470>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddd40550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddebfb20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddeb4f70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde16d240>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ddddeb280>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde1850c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dddfcae00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3dde185d20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9992770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9994640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9991fc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9c64a90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9d92d10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9c44e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e99943a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9c44520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9995510>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9a75d50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e99a1f30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9d92230>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9990f70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9994b20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9992230>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9b3d060>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9c65e40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9b3d6f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e98033d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f42e9b3c130>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.52s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_RShift, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" >> str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61143eda0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61144c8b0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61143cbe0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61144d3f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61143d9c0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61144d5d0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61143d780>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61170f760>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc611842800>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc6116f3220>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61171efe0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc61143f0a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" >> str(self.root)
E TypeError: unsupported operand type(s) for >>: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69b6830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69bc730>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69b5d50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6db6bc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69b49a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6a9beb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69b6590>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6a49480>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69bcfa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec68bc0d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6c533d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec68beef0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6ad0f40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69bc910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6db6e60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec6a98940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec68bf520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69b6590>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec68bfb80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3ec69b5ff0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7efd2710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7efd73a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef05c90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f178550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef07a00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f3ee980>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef06800>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7efd7220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef055a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f2896f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f3ee6e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f0d2fe0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f28be80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef04e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7efd0af0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef05f90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ee5f070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef040d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7f2a1570>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5e7ef04850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.55s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e76e560>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e780670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67dae0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e8b8550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67e230>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5ea0cf10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67e410>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5ea0e7d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67ea10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e66b010>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e907b50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5eb768c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e76d570>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67e440>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5ea50880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67dcc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e76fa30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e67fe80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e76ce20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c5e953eb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94aae5c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94a905e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949aaaa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94adbe20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949ab8b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94d3a170>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949aace0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94d38880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949abf70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949959f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94b501f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94b73490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94997280>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94ea2350>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94d382b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949aa8c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b948fe0b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949a84f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b94d7c0d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2b949a8d30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284cf6710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284d2c6a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284cf6020>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284fd0910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7285102f20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284fb4880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7285102e60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284fb4bb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7285102140>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7285102590>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284e017b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284c06470>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284b70550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284d2d030>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284cf4f70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284f9d240>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284c1b280>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284fb50c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284ecf310>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7284fb5d20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b8a710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b985e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b89450>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616f8e230>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b88d00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616e6b9a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b88580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616e3d270>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616c8abf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616a83df0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b88fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616a97190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616bb23e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616f8e740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616a813f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616c8a440>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616e3e770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616c892a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616e3c820>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9616b88460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_LShift, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" << str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a2582da0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a25848b0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a2580be0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a25853f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a25819c0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a25855d0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a2581780>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a2853760>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a29827a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a2837220>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a2666fe0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb7a25830a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" << str(self.root)
E TypeError: unsupported operand type(s) for <<: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.43s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7ae4d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7c95a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7ac220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973ebbafe0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7adae0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e89f1f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7ac5e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973ea68880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e8a71f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e6bf2b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7acaf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e6d1f30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e7ebcd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973ebbacb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e6bed10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e8a61a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973ea6b490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973e8a4700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973ea6a920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f973ea851e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec06440>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bea92740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beea5900>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec15a50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beea72e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beedb1c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bf0168c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec16080>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beec0ee0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14becfb490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bea815a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bf016e30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec17d60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beec1c60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec173d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beec3fa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec14130>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14beb16920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bec15180>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14bed4acb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.50s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345946fb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345a7d9f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73459440d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73458518a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f734591f0a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f734559b040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345774490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345a7e3b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73457759f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345930520>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345763850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f734591e2f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73456af2b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345775390>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345a7e9e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345777070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f73456ad3f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345774370>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345947940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7345931480>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87ba667d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87ba74790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87b9614e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bbe4b50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bd46920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87be68280>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87b962560>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87be6ab30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bbe7f10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bd27640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87ba74370>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87ba65ed0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bc04070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bbe6080>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bba2cb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87ba8fa90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87b8c5420>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bd241f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87bc05450>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff87ba77430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.55s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448ee7d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448f3160>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448edcf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344d0aad0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448ef880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23449ef430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448ee650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344bbd9c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448ecd90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344bda0b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448f38e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f234490e830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344ba6c20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f234480dc30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344ba72b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23449037f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344ba4e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344903670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2344aa73d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f23448ed960>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d6a740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d6ee90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d68430>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc9186f50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d69690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8e6b490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d69d20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc90397b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8ee7100>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8c8a0e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d68fd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8c9f700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8d8add0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc9186a10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8c8a530>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8ee6200>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc9038f70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc8ee6e00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc9039120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facc90476a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitOr, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" | str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f1ffe9e0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f1e77d60>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f1ffda50>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f1e76e90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f1ffee30>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f23fa5c0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f228b340>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f1e767a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f2025420>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f22bc7f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f2026e30>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fa6f22c1090>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" | str(self.root)
E TypeError: unsupported operand type(s) for |: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.40s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c56710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8b2d1e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c541f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8f2ef50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c55960>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c13c10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c54490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8ddd360>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c1f070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8a33310>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c544f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8a4b940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8b1a560>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8f2e770>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8a30e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c1e0b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8ddef50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8c1e920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8ddf8e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f69f8dee3b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05802740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce058307c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05803250>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05ac0850>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05801840>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05974160>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05801a80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05a9dff0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce0565bf10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05bea6e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce056edc30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05a84e50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce059ce560>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05659030>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05bead40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05998ac0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05701f90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05a845b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05700940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fce05a9d600>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.55s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c786740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c795660>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c7844c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02ca4c9a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c786ad0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c8dfa00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c787040>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02ca31cf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c5dfd90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02cb82da0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c676830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02ca18ca0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c86e890>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c5dcfa0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02cb830a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02ca32b30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c86c310>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c787cd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c68ad40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc02c785c30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb0ae4d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfaf15f00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb32ae00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb0e4c70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb32abc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfaf17490>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb32ba60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb0ae980>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb32bac0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb49ace0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb32b700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb35f2e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb32ada0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb3749d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfaf03e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb379cf0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb344910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb35d7b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb351360>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0cfb37ab60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.55s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179982650>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11799b8280>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a5ab0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179af3e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a7790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179c29e70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a7e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179c290c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a7190>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179891a50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179b229b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179a8a1a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179893640>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179d8f070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11797fd300>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a77c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179892d40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a5690>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1179981d80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f11798a6e90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31641ee500>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31641f4790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31641ec4f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31645eeb00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31641ed990>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31642d1120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31641edcc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31644a0700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f316432a920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31640f7e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31641ef670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f316410a080>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3164201e70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31645ee9e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31640f6e90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f316432a620>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31644a06d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f316432ad70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31644a11e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f31644be350>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitAnd, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" & str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50955dee00>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50955e0310>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50955ddf90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50955e01c0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50955dd2a0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50958ad6f0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50955dd210>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50956e9a50>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50959fad70>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50956ea260>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50958cd690>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f50956eae90>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" & str(self.root)
E TypeError: unsupported operand type(s) for &: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abf2a710>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abf604f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abf2b460>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac2045e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac336800>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac1e46d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac3369b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac1e6920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac337010>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac215030>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac1e0070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac0328c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abda7220>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abf61db0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abe4dae0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abf63670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abe39630>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3abf60370>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac1e7eb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd3ac03f910>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9921ba440>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd992043e80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9921b87c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9924a1780>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9921ba8f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9920313c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd992456b90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd992031ed0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9924564a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9922aa6b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd992030e20>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9924712a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd99248a0e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd992455870>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9920431c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9922ab100>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd99247c400>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9922a9e10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd99247d720>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd99221fa90>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7b2530>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7ec310>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d2d40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a96cf40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d2200>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7b20b0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d3c10>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7b0760>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d28f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67aa62fe0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7eddb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67aaa6410>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a626560>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d2f80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7b21a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d3700>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7b1f00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a6d02e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a7b2920>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa67a9a0be0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.53s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fd66e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fe4670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fd46a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a2a4d30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fd5150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a157070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fd64a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a155f60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fd5d80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a2b67d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a3da830>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a0deec0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a2b4760>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fe4790>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909ecde70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a1549d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909ecf1c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa90a156c50>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fd6cb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa909fe6500>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4872740>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d48809d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4870580>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4b40a30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4871720>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d49d3cd0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d48711e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d49d3160>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4871c00>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4b51120>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4c766e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4a11ea0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4b52320>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4880880>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4768370>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d49d10f0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d476ae60>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d49d34c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d48710c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f13d4882590>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
leftS = str(self.left)
if self.right:
rightS = str(self.right)
- return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+ return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
def inorder(self):
"""In order traversal generator of tree rooted at given node."""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:15:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f55554626e0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:31:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555546aef0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f55554606a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555748d30>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555461150>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555559c670>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f55554624a0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555559f940>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555461d80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:88:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f55555627d0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:96:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555587e860>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:105:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555586f80>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:49:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555560760>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555546b070>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
> var_8 = var_3.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:151:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555381e70>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_node_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555559dcc0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f55553831c0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f555559c550>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555462cb0>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:163: in __repr__
return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5555468f40>
def __repr__(self):
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
if self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)
> return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - TypeErr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - TypeEr...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 20 failed, 75 passed in 0.49s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Add_BitXor, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
def __repr__(self):
if self.root is None:
return "binary:()"
- return "binary:" + str(self.root)
+ return "binary:" ^ str(self.root)
"""
Change Log:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .........F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F........... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:76:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bce6dd0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bceb130>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
> var_8 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bce4c10>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bce80d0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
> var_6 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:291:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bce5930>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:356:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bceb640>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
> var_11 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:396:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bce4c70>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bc1a710>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:384:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1c103130>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:435:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bc18070>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:458:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bde7ee0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
> var_4 = binary_tree_0.__repr__()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:484:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f2c1bc05ed0>
def __repr__(self):
if self.root is None:
return "binary:()"
> return "binary:" ^ str(self.root)
E TypeError: unsupported operand type(s) for ^: 'str' and 'str'
binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - Ty...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - T...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - TypeE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - TypeE...
======================== 12 failed, 83 passed in 0.39s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Add, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value + target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Add, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value + target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Add, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value + target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Mul, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value * target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Mul, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value * target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Mul, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value * target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Div, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value / target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FF..... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....F.............F.... [ 89%]
..FF....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
> var_3 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
> var_4 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
> var_3 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
> var_8 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:321:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - ZeroDi...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 8 failed, 87 passed in 0.38s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Div, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value / target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FF..... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....F.............F.... [ 89%]
..FF....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
> var_3 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
> var_4 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
> var_3 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
> var_8 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:321:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value / target) < distance:
E ZeroDivisionError: division by zero
binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - ZeroDi...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 8 failed, 87 passed in 0.38s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Div, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value / target)
best = node
if target < node.value:
node = node.left============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
...F....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value / target)
E ZeroDivisionError: division by zero
binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 3 failed, 92 passed in 0.29s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_FloorDiv, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value // target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FF..... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....F.............F.... [ 89%]
..FF....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
> var_3 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
> var_4 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
> var_3 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
> var_8 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:321:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - ZeroDi...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 8 failed, 87 passed in 0.39s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_FloorDiv, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value // target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FF..... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....F.............F.... [ 89%]
..FF....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
> var_3 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
> var_4 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
> var_3 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
> var_8 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:321:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value // target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - ZeroDi...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 8 failed, 87 passed in 0.38s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_FloorDiv, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value // target)
best = node
if target < node.value:
node = node.left============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
...F....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value // target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 3 failed, 92 passed in 0.30s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Mod, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value % target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FF..... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....F.............F.... [ 89%]
..FF....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
> var_3 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
> var_4 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
> var_3 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
> var_8 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:321:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - ZeroDi...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 8 failed, 87 passed in 0.38s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Mod, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value % target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FF..... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....F.............F.... [ 89%]
..FF....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
> var_3 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
> var_4 = binary_tree_0.closest(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
> var_3 = binary_tree_0.closest(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
> var_8 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:321:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value % target) < distance:
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - Z...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - ZeroDi...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 8 failed, 87 passed in 0.37s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Mod, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value % target)
best = node
if target < node.value:
node = node.left============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
...F....FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
> var_10 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:348:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) 427 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
> var_12 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:470:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:)), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
> var_14 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:500:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
> distance = abs(node.value % target)
E ZeroDivisionError: integer division or modulo by zero
binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - ZeroD...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - ZeroD...
========================= 3 failed, 92 passed in 0.31s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Pow, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value ** target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
> var_7 = binary_tree_0.closest(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:235:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = -201
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value ** target)
E ZeroDivisionError: 0.0 cannot be raised to a negative power
binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - Z...
========================= 1 failed, 94 passed in 0.28s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_Pow, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value ** target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
> var_7 = binary_tree_0.closest(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:235:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = -201
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value ** target) < distance:
E ZeroDivisionError: 0.0 cannot be raised to a negative power
binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - Z...
========================= 1 failed, 94 passed in 0.29s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_Pow, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value ** target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_RShift, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value >> target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
> var_7 = binary_tree_0.closest(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:235:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = -201
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value >> target)
E ValueError: negative shift count
binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
========================= 1 failed, 94 passed in 0.26s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_RShift, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value >> target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
> var_7 = binary_tree_0.closest(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:235:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = -201
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value >> target) < distance:
E ValueError: negative shift count
binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
========================= 1 failed, 94 passed in 0.28s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_RShift, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value >> target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_LShift, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value << target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
> var_7 = binary_tree_0.closest(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:235:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = -201
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value << target)
E ValueError: negative shift count
binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
========================= 1 failed, 94 passed in 0.28s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceBinaryOperator_Sub_LShift, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value << target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
> var_7 = binary_tree_0.closest(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:235:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:), target = -201
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is None:
return None
best = node = self.root
distance = abs(self.root.value - target)
while node:
> if abs(node.value << target) < distance:
E ValueError: negative shift count
binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
========================= 1 failed, 94 passed in 0.29s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_LShift, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value << target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitOr, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value | target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitOr, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value | target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitOr, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value | target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitAnd, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value & target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitAnd, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value & target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitAnd, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value & target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitXor, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
return None
best = node = self.root
- distance = abs(self.root.value - target)
+ distance = abs(self.root.value ^ target)
while node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitXor, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value ^ target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceBinaryOperator_Sub_BitXor, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
distance = abs(self.root.value - target)
while node:
if abs(node.value - target) < distance:
- distance = abs(node.value - target)
+ distance = abs(node.value ^ target)
best = node
if target < node.value:
node = node.left============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_NotEq_Is, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
- while n.left != None:
+ while n.left is None:
n = n.left
return n.value
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ....F...........F.. [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ................F....... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F...F....... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:38:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f9883bc6380>
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left is None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:143:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left is None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:227:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left is None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:149:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f9883bc4400>
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left is None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L: True R:)'
> var_6 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:112:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left is None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is True
> var_2 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left is None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_4 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_16 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Attri...
========================= 6 failed, 89 passed in 0.31s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_NotEq_Is, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
- while n.right != None:
+ while n.right is None:
n = n.right
return n.value
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FFF.FF. [ 20%]
FFFFFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..................F..... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F..FFFFF.FF. [ 89%]
FFFFF.FFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:95:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:106:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:121:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:145:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:166:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:229:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:288:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.getMin()
assert var_3 is False
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:307:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:350:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: True R:)) 3380 R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
> assert var_6 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f36ef019ea0>
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:102:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:148:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:185:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: binary:() R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:199:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:246:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:278:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:312:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
var_4 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(var_2)
var_5 = binary_tree_0.add(bool_0)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:369:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: True R:) True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
> assert var_7 == 1625
E assert -2656 == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
> var_8 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:492:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right is None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_18 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 34 failed, 61 passed in 0.64s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Eq, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val == self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....FF.F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'X>'
str_1 = 'qkr(Szzyf\t'
binary_node_0 = module_0.BinaryNode(str_1)
var_0 = binary_node_0.remove(str_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_5 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
======================== 10 failed, 85 passed in 0.37s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Eq, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target == node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...F.FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .................FF.... [ 89%]
.......F.. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.getMax()
assert var_3 == 'binary:()'
var_4 = binary_tree_0.__iter__()
var_5 = binary_tree_0.__contains__(var_1)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
======================== 16 failed, 79 passed in 0.42s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_Eq, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) == distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Eq, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target == node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert -201 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
var_8 = binary_tree_0.closest(var_0)
> assert var_8 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:322: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
========================= 2 failed, 93 passed in 0.30s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_NotEq, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val != self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
========================= 1 failed, 94 passed in 0.28s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_NotEq, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target != node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
........F..F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = var_5.__repr__()
assert var_6 == 'True'
var_7 = binary_tree_0.__contains__(var_3)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
========================= 5 failed, 90 passed in 0.33s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_NotEq, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) != distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_NotEq, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target != node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
...FF.....FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.....F..F. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
> assert var_7 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
assert var_8 == 427
bool_1 = True
var_9 = binary_tree_0.add(bool_1)
var_10 = var_6.closest(bool_1)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
========================= 6 failed, 89 passed in 0.31s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_LtE, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val <= self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....F..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
========================= 9 failed, 86 passed in 0.34s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_LtE, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target <= node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..................F.... [ 89%]
.....FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 20 failed, 75 passed in 0.47s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_LtE, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) <= distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_LtE, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target <= node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.27s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Gt, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val > self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .....F.................. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'X>'
str_1 = 'qkr(Szzyf\t'
binary_node_0 = module_0.BinaryNode(str_1)
var_0 = binary_node_0.remove(str_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:54: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_5 - Asserti...
========================= 2 failed, 93 passed in 0.28s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Gt, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target > node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
........F..F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .................F..... [ 89%]
.......FF. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = var_5.__repr__()
assert var_6 == 'True'
var_7 = binary_tree_0.__contains__(var_3)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.getMax()
assert var_3 == 'binary:()'
var_4 = binary_tree_0.__iter__()
var_5 = binary_tree_0.__contains__(var_1)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
========================= 5 failed, 90 passed in 0.33s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_Gt, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) > distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Gt, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target > node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..FFF.....FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
..F.....F. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert -201 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
> assert var_7 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
var_8 = binary_tree_0.closest(var_0)
> assert var_8 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
========================= 7 failed, 88 passed in 0.34s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_GtE, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val >= self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....FF.F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'X>'
str_1 = 'qkr(Szzyf\t'
binary_node_0 = module_0.BinaryNode(str_1)
var_0 = binary_node_0.remove(str_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_5 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
======================== 10 failed, 85 passed in 0.37s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_GtE, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target >= node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...F.FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .................FF.... [ 89%]
.......FF. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.getMax()
assert var_3 == 'binary:()'
var_4 = binary_tree_0.__iter__()
var_5 = binary_tree_0.__contains__(var_1)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
======================== 17 failed, 78 passed in 0.43s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_GtE, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) >= distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_GtE, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target >= node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..FFF.....FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
..F.....F. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert -201 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
> assert var_7 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
var_8 = binary_tree_0.closest(var_0)
> assert var_8 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
========================= 7 failed, 88 passed in 0.34s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Is, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val is self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....FF.F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'X>'
str_1 = 'qkr(Szzyf\t'
binary_node_0 = module_0.BinaryNode(str_1)
var_0 = binary_node_0.remove(str_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_5 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
======================== 10 failed, 85 passed in 0.37s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Is, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target is node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...F.FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .................FF.... [ 89%]
.......F.. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.getMax()
assert var_3 == 'binary:()'
var_4 = binary_tree_0.__iter__()
var_5 = binary_tree_0.__contains__(var_1)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
======================== 16 failed, 79 passed in 0.39s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_Is, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) is distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_Is, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target is node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert -201 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
var_8 = binary_tree_0.closest(var_0)
> assert var_8 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:322: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
========================= 2 failed, 93 passed in 0.30s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_IsNot, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if val is not self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
========================= 1 failed, 94 passed in 0.30s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_IsNot, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if target is not node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
........F..F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = var_5.__repr__()
assert var_6 == 'True'
var_7 = binary_tree_0.__contains__(var_3)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
========================= 5 failed, 90 passed in 0.33s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Lt_IsNot, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if abs(node.value - target) is not distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Lt_IsNot, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if target is not node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
...FF.....FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.....F..F. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
> assert var_7 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
assert var_8 == 427
bool_1 = True
var_9 = binary_tree_0.add(bool_1)
var_10 = var_6.closest(bool_1)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
========================= 6 failed, 89 passed in 0.31s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_Eq, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val == self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
...F.FF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
var_10 = binary_tree_0.closest(var_0)
> assert var_10 is False
E assert 427 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L: 1656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
========================= 6 failed, 89 passed in 0.35s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_NotEq, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val != self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F........F.......FF [ 20%]
FF.FFF..FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py FF..F..F.F.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F.............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
var_0 = binary_node_0.add(int_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: True R:) False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
assert var_8 == 427
bool_1 = True
var_9 = binary_tree_0.add(bool_1)
var_10 = var_6.closest(bool_1)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:(L:(L: False R:) -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 29 failed, 66 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_Lt, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val < self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F........F.......F. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .F..F..F.F.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F.............F........ [ 89%]
.F........ [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
var_0 = binary_node_0.add(int_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E AssertionError: assert 'binary:(L: F...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E - binary:(L: False R:(L:(L: True R:) True R:))
E ? --- ---------
E + binary:(L: False R:(L: True R:))
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L... R:) True R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E ? ^^^ ----------
E + binary:(L:(L: False R:) True R:)
E ? ^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E AssertionError: assert 'binary:(L: -...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E ? --- ---------
E + binary:(L: -4493 R:(L: False R:(L: True R:)))
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:290: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
======================== 14 failed, 81 passed in 0.40s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_Gt, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val > self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F........F.......FF [ 20%]
FF.FFF..FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py FF..F..F.F.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F.............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
var_0 = binary_node_0.add(int_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:(L:(L: False R:) -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L: 1656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 29 failed, 66 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_GtE, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val >= self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..................F [ 20%]
FF.FF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py F......F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:(L:(L: False R:) -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L: 1656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 21 failed, 74 passed in 0.48s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_Is, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val is self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
...F.FF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
var_10 = binary_tree_0.closest(var_0)
> assert var_10 is False
E assert 427 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L: 1656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
========================= 6 failed, 89 passed in 0.33s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_LtE_IsNot, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if val is not self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F........F.......FF [ 20%]
FF.FFF..FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py FF..F..F.F.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F.............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
var_0 = binary_node_0.add(int_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: True R:) False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
assert var_8 == 427
bool_1 = True
var_9 = binary_tree_0.add(bool_1)
var_10 = var_6.closest(bool_1)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:(L:(L: False R:) -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 29 failed, 66 passed in 0.54s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Eq, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val == self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..................F [ 20%]
FF.FF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py F......F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
> assert var_8 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E ? ------------ -
E + binary:(L: -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 21 failed, 74 passed in 0.46s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Eq, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val == self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..F.F..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F......F [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________
def test_case_2():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.remove(bool_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_2 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 11 failed, 84 passed in 0.39s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Eq, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target == node.value:
node = node.right
else:
return True============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...FFF. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..................F.... [ 89%]
.....FF... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
======================== 16 failed, 79 passed in 0.39s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Eq, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target == node.value:
node = node.right
else:
return target============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................F.. [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert 451 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
========================= 1 failed, 94 passed in 0.29s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_NotEq, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val != self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_NotEq, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val != self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_NotEq, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target != node.value:
node = node.right
else:
return True============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_NotEq, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target != node.value:
node = node.right
else:
return target============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Lt, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val < self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..................F [ 20%]
FF.FF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py F......F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
> assert var_8 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E ? ------------ -
E + binary:(L: -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 21 failed, 74 passed in 0.48s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Lt, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val < self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..F..................... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
......F..F [100%]
=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...R:)) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E ? ^^^^ ^^^^
E + binary:(L:(L: True R:(L: 3380 R:)) 3380 R:)
E ? ^^^ ^^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________
def test_case_2():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.remove(bool_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
assert var_6 is True
var_7 = var_4.remove(var_2)
var_8 = binary_tree_0.closest(var_6)
> assert var_8 is True
E assert 1625 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_2 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
========================= 4 failed, 91 passed in 0.32s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Lt, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target < node.value:
node = node.right
else:
return True============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:170: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
========================= 1 failed, 94 passed in 0.28s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Lt, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target < node.value:
node = node.right
else:
return target============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................F.. [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert 451 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
========================= 1 failed, 94 passed in 0.26s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_LtE, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val <= self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..................F [ 20%]
FF.FF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py F......F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
> assert var_8 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E ? ------------ -
E + binary:(L: -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 21 failed, 74 passed in 0.45s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_LtE, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val <= self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..F.F..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F......F [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________
def test_case_2():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.remove(bool_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_2 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 11 failed, 84 passed in 0.36s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_LtE, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target <= node.value:
node = node.right
else:
return True============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...FFF. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..................F.... [ 89%]
.....FF... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
======================== 16 failed, 79 passed in 0.40s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_LtE, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target <= node.value:
node = node.right
else:
return target============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................F.. [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert 451 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
========================= 1 failed, 94 passed in 0.26s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_GtE, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val >= self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_GtE, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val >= self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....F..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
========================= 9 failed, 86 passed in 0.34s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_GtE, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target >= node.value:
node = node.right
else:
return True============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..................F.... [ 89%]
.....FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 20 failed, 75 passed in 0.44s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_GtE, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target >= node.value:
node = node.right
else:
return target============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Is, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val is self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..................F [ 20%]
FF.FF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py F......F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
> assert var_8 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E ? ------------ -
E + binary:(L: -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 21 failed, 74 passed in 0.49s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Is, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val is self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..F.F..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F......F [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________
def test_case_2():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.remove(bool_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_2 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 11 failed, 84 passed in 0.36s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Is, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target is node.value:
node = node.right
else:
return True============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...FFF. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..................F.... [ 89%]
.....FF... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
======================== 16 failed, 79 passed in 0.42s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Gt_Is, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target is node.value:
node = node.right
else:
return target============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................F.. [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert 451 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
========================= 1 failed, 94 passed in 0.28s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_IsNot, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
"""
if val <= self.value:
self.left = self.addToSubTree(self.left, val)
- elif val > self.value:
+ elif val is not self.value:
self.right = self.addToSubTree(self.right, val)
def addToSubTree(self, parent, val):============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_IsNot, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
- elif val > self.value:
+ elif val is not self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_IsNot, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
while node:
if target < node.value :
node = node.left
- elif target > node.value:
+ elif target is not node.value:
node = node.right
else:
return True============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ReplaceComparisonOperator_Gt_IsNot, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
best = node
if target < node.value:
node = node.left
- elif target > node.value:
+ elif target is not node.value:
node = node.right
else:
return target============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
- if parent is None:
+ if parent is not None:
return BinaryNode(val)
parent.add(val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F.F......F......FFF [ 20%]
FF.FFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py FF..F..F.F.....F........ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py FFF........F..F.F...FFF [ 89%]
FFFFFFFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
> var_0 = binary_node_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:9:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 442 R:), parent = None, val = 442
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:25:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:75:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
var_9 = binary_tree_0.__repr__()
assert var_9 == 'binary:(L: False R:)'
> var_10 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:155:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = 451
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
> var_6 = binary_tree_0.add(var_5)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:171:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
> var_0 = binary_node_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:182:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:194:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:212:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:247:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:269:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:287:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:304:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:330:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:346:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 3380 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:369:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:385:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: -4493 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
> var_0 = binary_node_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:10:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:139:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: binary:() R:), parent = None, val = 'binary:()'
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_node_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:11:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:29:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
object_0 = module_1.object()
var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_node_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:133:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
> var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:239:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: None R:), parent = None, val = (L: None R:)
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
object_0 = module_1.object()
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_node_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:289:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
> var_3 = binary_node_0.addToSubTree(var_2, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:360:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
> var_3 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:457:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: -2656 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:483:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 1656 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if parent is not None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_1 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 41 failed, 54 passed in 0.74s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
- if self.left is None:
+ if self.left is not None:
return self.right
child = self.left============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ...........F.....F. [ 20%]
F........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ...FF..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF.....F.. [ 89%]
..FF.FF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________
def test_case_11():
bool_0 = False
list_0 = [bool_0, bool_0]
binary_node_0 = module_0.BinaryNode(list_0)
> var_0 = binary_node_0.remove(list_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:87:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: [False, False] R:), val = [False, False]
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.add(var_5)
> var_7 = binary_tree_0.remove(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:198:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L:(L: True R:) True R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_3 __________________________________
def test_case_3():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:33:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
> var_3 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:104:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
> var_2 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:124:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
assert var_5 == 427
> var_6 = binary_tree_0.remove(var_5)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:229:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 427 R:), val = 427
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
> var_5 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:314:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
> var_7 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:342:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: 427 R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
> var_5 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:391:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: 427 R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
> var_3 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:416:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:(L: 1625 R:)), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
> var_8 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:465:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: 1625 R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is not None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_11 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_3 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 18 failed, 77 passed in 0.48s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
def add(self, value):
"""Insert value into proper location in Binary Tree."""
- if self.root is None:
+ if self.root is not None:
self.root = BinaryNode(value)
else:
self.root.add(value)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..F.F...FF..FFF.FF. [ 20%]
FFFFFFFFFFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..........FFFF.FF.F.FF.F [ 57%]
.F..F.. [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .FF.F......F.FFFFFF.FFF [ 89%]
FFFFFFFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:23:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:36:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________
def test_case_8():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
var_1 = binary_tree_0.__repr__()
assert var_1 == 'binary:()'
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:65:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 'binary:()'
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:73:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:93:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:104:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:119:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:140:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:190:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:208:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
> var_3 = binary_tree_0.add(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:225:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:243:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:265:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:285:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:302:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:318:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:326:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
> var_2 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:344:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 3380
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:365:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
> var_2 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:383:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = -4493
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_10 _________________________________
def test_case_10():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:115:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:120:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:125:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:137:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 'binary:()'
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:147:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
> var_0 = binary_tree_0.add(set_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:174:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = {binary:()}
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:181:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
bool_0 = True
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:192:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:217:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:27:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:39:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:55:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_1 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:100:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:121:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:146:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:158:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:171:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:183:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 'binary:()'
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:197:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:220:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
> var_3 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:244:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:257:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:275:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:293:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:309:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
> var_3 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:333:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
> var_4 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:365:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_1 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:382:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:408:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:433:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
> var_1 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:452:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = -2656
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
> var_2 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:481:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 1656
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if self.root is not None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_4 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_8 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_26 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_10 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_11 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_12 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_13 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_16 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_18 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_21 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_23 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_25 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_28 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_1 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 56 failed, 39 passed in 0.90s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
def getMin(self):
"""Returns minimum value."""
- if self.root is None:
+ if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
while n.left != None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ....FF..........F.. [ 20%]
..F..FF..... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ...............FFF...... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ......F....F...F......F [ 89%]
....F..... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:38:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f0b5422e590>
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________
def test_case_5():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
with pytest.raises(ValueError):
> binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:47:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:143:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:227:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
assert var_6 == 'binary:(L:(L: False R:) False R:)'
binary_node_0 = module_0.BinaryNode(var_5)
> var_7 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:294:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
> var_3 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:305:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.__iter__()
var_4 = var_3.__repr__()
> var_5 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:142:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: binary:() R:) binary:() R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:149:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f0b5451edd0>
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:156:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_6 __________________________________
def test_case_6():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:68:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L: True R:)'
> var_6 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:112:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is True
> var_2 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
object_0 = module_1.object()
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:264:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: True R:) True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
var_4 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(var_2)
var_5 = binary_tree_0.add(bool_0)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
var_8 = module_0.BinaryNode(binary_tree_0)
> var_9 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:373:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L:(L: True R:) True R:) True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_4 - Va...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_5 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - ValueE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_16 - ValueE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_17 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_6 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Value...
======================== 14 failed, 81 passed in 0.44s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
def getMax(self):
"""Returns maximum value."""
- if self.root is None:
+ if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
while n.right != None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ......F.....FFF.FF. [ 20%]
FFFFFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..................FF.... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .......F...F..FFFFF.FF. [ 89%]
FFFFF.FFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________
def test_case_6():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:52:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:95:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:106:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:121:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:145:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:166:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:195:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:213:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:229:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:248:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:270:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:288:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.getMin()
assert var_3 is False
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:307:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:331:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:350:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: True R:)) 3380 R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:370:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:389:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -4493 R:(L: False R:(L: True R:)))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f3411eb5090>
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:169:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_7 __________________________________
def test_case_7():
binary_tree_0 = module_0.BinaryTree()
var_0 = module_0.BinaryTree()
var_1 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:75:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:102:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:148:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:174:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:185:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: binary:() R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:199:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:227:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: 427 R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:246:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:278:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:298:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:312:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:340:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: 427 R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
var_4 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(var_2)
var_5 = binary_tree_0.add(bool_0)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:369:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: True R:) True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:414:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:(L: 1625 R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:442:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: 427 R:))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
> var_7 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:463:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
> var_8 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:492:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)
def getMax(self):
"""Returns maximum value."""
if self.root is not None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_6 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_18 - ValueE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_19 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_7 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Value...
======================== 37 failed, 58 passed in 0.67s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
Return value closest to target. If there are several, then
return one of them.
"""
- if self.root is None:
+ if self.root is not None:
return None
best = node = self.root============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .......F....FF..F.. [ 20%]
FFFFF..FFFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......................F [ 57%]
F...... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..F.F....F.F..F...F..FF [ 89%]
F.FFFFF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________
def test_case_7():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:56:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.closest(var_2)
> assert var_3 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
var_4 = binary_tree_0.closest(var_2)
> assert var_4 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:187:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:205:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:240:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:262:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:317:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:323:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:340:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:362:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:379:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
bool_0 = True
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.closest(bool_0)
> assert var_1 is True
E assert None is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:195: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:199:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:36:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.closest(bool_0)
> assert var_1 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
float_0 = 1747.362
dict_0 = {float_0: float_0}
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(dict_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:87:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = {1747.362: 1747.362}
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:135:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
var_3 = binary_tree_0.closest(bool_0)
> assert var_3 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_1 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:237:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:272:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:306:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
var_10 = binary_tree_0.closest(var_0)
> assert var_10 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
> var_2 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:358:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if self.root is not None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
> assert var_8 == 427
E assert None == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
assert var_6 is True
var_7 = var_4.remove(var_2)
var_8 = binary_tree_0.closest(var_6)
> assert var_8 is True
E assert None is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_7 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_26 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_23 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_24 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_9 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 32 failed, 63 passed in 0.65s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceComparisonOperator_Is_IsNot, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
yield e
def __repr__(self):
- if self.root is None:
+ if self.root is not None:
return "binary:()"
return "binary:" + str(self.root)
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ........FF......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ...............F........ [ 57%]
...F... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..........FF.....F..... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________
def test_case_8():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
var_1 = binary_tree_0.__repr__()
> assert var_1 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E - binary:(L: False R:(L:(L: True R:) True R:))
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:136: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:213: AssertionError
_________________________________ test_case_10 _________________________________
def test_case_10():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
> assert var_5 == 'binary:(L: True R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E - binary:(L: True R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
> assert var_2 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
> assert var_3 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_8 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_27 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_10 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 17 failed, 78 passed in 0.41s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
"""
Add a new node to the tree with value. Respond based on Set semantics
"""
- if val <= self.value:
+ if not val <= self.value:
self.left = self.addToSubTree(self.left, val)
elif val > self.value:
self.right = self.addToSubTree(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F........F.......FF [ 20%]
FF.FFF..FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py FF..F..F.F.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F.............F.F...F.. [ 89%]
.F.F.FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
var_0 = binary_node_0.add(int_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
var_0 = binary_node_0.add(bool_0)
> assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:(L:(L: False R:) -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L: 1656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 29 failed, 66 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
- if parent is None:
+ if not parent is None:
return BinaryNode(val)
parent.add(val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py F.F......F......FFF [ 20%]
FF.FFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py FF..F..F.F.....F........ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py FFF........F..F.F...FFF [ 89%]
FFFFFFFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________
def test_case_0():
int_0 = 442
binary_node_0 = module_0.BinaryNode(int_0)
> var_0 = binary_node_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:9:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 442 R:), parent = None, val = 442
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:25:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:75:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
var_9 = binary_tree_0.__repr__()
assert var_9 == 'binary:(L: False R:)'
> var_10 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:155:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = 451
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
> var_6 = binary_tree_0.add(var_5)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:171:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
> var_0 = binary_node_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:182:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:194:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:212:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:247:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:269:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:287:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:304:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:330:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:346:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 3380 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
> var_4 = binary_tree_0.add(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:369:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:385:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: -4493 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________
def test_case_0():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
> var_0 = binary_node_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:10:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
> assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:139:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: binary:() R:), parent = None, val = 'binary:()'
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_node_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:11:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:29:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
object_0 = module_1.object()
var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_node_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:133:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:173:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
> var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:239:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: None R:), parent = None, val = (L: None R:)
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
object_0 = module_1.object()
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_node_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:289:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
> assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
> var_3 = binary_node_0.addToSubTree(var_2, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:360:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
> assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E - binarySearchTree1.BinaryTree
E ? ^^ -
E + binarySearchTree1.BinaryNode
E ? ^^^
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
> var_3 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:457:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:21: in add
self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: -2656 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:483:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:93: in add
self.root.add(value)
binarySearchTree1.py:19: in add
self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 1656 R:), parent = None, val = False
def addToSubTree(self, parent, val):
"""Add val to parent subtree (if exists) and return root of that subtree."""
if not parent is None:
return BinaryNode(val)
> parent.add(val)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_0 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_18 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_0 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_1 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_1 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 41 failed, 54 passed in 0.78s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
"""
Remove val of self from BinaryTree.
"""
- if val < self.value:
+ if not val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .................F. [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....FF.F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF........ [ 89%]
..F....... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'X>'
str_1 = 'qkr(Szzyf\t'
binary_node_0 = module_0.BinaryNode(str_1)
var_0 = binary_node_0.remove(str_0)
> assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E - binarySearchTree1.BinaryNode
E + builtins.NoneType
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_5 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
======================== 10 failed, 85 passed in 0.37s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 3
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
- if self.left is None:
+ if not self.left is None:
return self.right
child = self.left============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ...........F.....F. [ 20%]
F........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ...FF..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F..........F.FF.....F.. [ 89%]
..FF.FF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________
def test_case_11():
bool_0 = False
list_0 = [bool_0, bool_0]
binary_node_0 = module_0.BinaryNode(list_0)
> var_0 = binary_node_0.remove(list_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:87:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: [False, False] R:), val = [False, False]
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.add(var_5)
> var_7 = binary_tree_0.remove(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:198:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L:(L: True R:) True R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_3 __________________________________
def test_case_3():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:33:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
> var_3 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:104:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
> var_2 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:124:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
assert var_5 == 427
> var_6 = binary_tree_0.remove(var_5)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:229:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: 427 R:), val = 427
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
> var_5 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:314:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
> var_7 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:342:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: 427 R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
> var_5 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:391:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: 427 R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
> var_3 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:416:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:(L: 1625 R:)), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
> var_8 = binary_tree_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:465:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: 1625 R:)), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if not self.left is None:
return self.right
child = self.left
> while child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_11 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_3 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 18 failed, 77 passed in 0.51s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 4
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -41,7 +41,7 @@
return self.right
child = self.left
- while child.right:
+ while not child.right:
child = child.right
childKey = child.value;============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..F......F.......F. [ 20%]
....FFF..F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....F..F................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py F.............F........ [ 89%]
........F. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.remove(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:26:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) False R:)'
> var_5 = binary_tree_0.remove(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:78:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
> var_7 = binary_tree_0.remove(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:172:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
> var_9 = binary_tree_0.remove(var_6)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:276:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: True R:) True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
assert var_6 == 'binary:(L:(L: False R:) False R:)'
binary_node_0 = module_0.BinaryNode(var_5)
var_7 = binary_tree_0.getMin()
assert var_7 is False
> var_8 = binary_tree_0.remove(var_4)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:296:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.getMin()
assert var_3 is False
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_2.__repr__()
binary_node_0 = module_0.BinaryNode(var_5)
var_6 = binary_tree_0.add(var_0)
var_7 = binary_tree_0.getMin()
> var_8 = binary_tree_0.remove(var_7)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:313:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L:(L: False R:) False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:)) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: True R:(L: 3380 R:)) False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = var_0.removeFromParent(binary_node_0, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:41:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: True R:) True R:), val = True
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:72:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_node_0.remove(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:13:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
> var_3 = binary_node_0.remove(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:136:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) False R:), val = False
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
> var_11 = var_9.remove(var_7)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:469:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L:(L: False R:) 1625 R:), val = 1625
def remove(self, val):
"""
Remove val of self from BinaryTree.
"""
if val < self.value:
self.left = self.removeFromParent(self.left, val)
elif val > self.value:
self.right = self.removeFromParent(self.right, val)
else:
if self.left is None:
return self.right
child = self.left
> while not child.right:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
======================== 12 failed, 83 passed in 0.63s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 5
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -53,7 +53,7 @@
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
- if parent:
+ if not parent:
return parent.remove(val)
return None
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............F..... [ 20%]
.........F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..F.FFFF................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..............F......F. [ 89%]
......F.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
var_4 = binary_tree_0.closest(var_2)
assert var_4 is False
var_5 = var_2.__repr__()
> var_6 = binary_tree_0.remove(var_3)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:113:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
if not parent:
> return parent.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:57: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L: 3380 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________
def test_case_2():
bool_0 = True
bool_1 = False
binary_node_0 = module_0.BinaryNode(bool_1)
> var_0 = binary_node_0.remove(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:24:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:38: in remove
self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = None, val = True
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
if not parent:
> return parent.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:57: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: True R:) is None
E + where (L: True R:) = (L:(L: True R:) True R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'X>'
str_1 = 'qkr(Szzyf\t'
binary_node_0 = module_0.BinaryNode(str_1)
> var_0 = binary_node_0.remove(str_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:53:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:36: in remove
self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: qkr(Szzyf R:), parent = None, val = 'X>'
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
if not parent:
> return parent.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:57: AttributeError
_________________________________ test_case_6 __________________________________
def test_case_6():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_0 = binary_node_0.removeFromParent(bool_0, bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:64:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:), parent = False, val = False
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
if not parent:
> return parent.remove(val)
E AttributeError: 'bool' object has no attribute 'remove'
binarySearchTree1.py:57: AttributeError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
> assert binary_node_0.left is None
E assert (L: False R:) is None
E + where (L: False R:) = (L:(L: False R:) False R:).left
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
var_8 = var_3.__repr__()
assert var_8 == '(L: False R:(L: True R:))'
> object_0 = binary_node_0.removeFromParent(var_5, var_5)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:153:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: False R:(L: True R:)), parent = None, val = None
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
if not parent:
> return parent.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMax()
assert var_4 is True
> var_5 = binary_tree_0.remove(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:248:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
binarySearchTree1.py:98: in remove
self.root = self.root.remove(val)
binarySearchTree1.py:36: in remove
self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = (L: True R:), parent = None, val = False
def removeFromParent(self, parent, val):
"""Helper method for remove. Ensures proper behavior when removing node that
has children."""
if not parent:
> return parent.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:57: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
assert var_6 is True
var_7 = var_4.remove(var_2)
var_8 = binary_tree_0.closest(var_6)
> assert var_8 is True
E assert 1625 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert 1656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_2 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_4 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_5 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_6 - Attribu...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - assert ...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 12 failed, 83 passed in 0.41s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 6
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -61,7 +61,7 @@
"""Useful debugging function to produce linear tree representation."""
leftS = ''
rightS = ''
- if self.left:
+ if not self.left:
leftS = str(self.left)
if self.right:
rightS = str(self.right)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: None R:)'
E AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E - (L: None R:)
E ? -
E + (L:None None R:)
E ? +++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: None R:)'
E AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E - (L: None R:)
E ? -
E + (L:None None R:)
E ? +++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:None False R:)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:None False R:)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E AssertionError: assert 'binary:(L:No...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E - binary:(L: False R:(L:(L: True R:) True R:))
E ? --- ---------
E + binary:(L:None False R:(L: True R:))
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E ? --- ----------
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L: 3380 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E AssertionError: assert 'binary:(L:No...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E ? --- ---------
E + binary:(L:None -4493 R:(L:None False R:(L: True R:)))
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_0.__repr__()
> assert var_3 == '(L: False R:(L: True R:))'
E AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E - (L: False R:(L: True R:))
E + (L:None False R:(L:None True R:))
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:89: AssertionError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: False R:)'
E AssertionError: assert '(L:None False R:)' == '(L: False R:)'
E - (L: False R:)
E + (L:None False R:)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:97: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
> assert var_1 == '(L:(L: True R:) True R:)'
E AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E - (L:(L: True R:) True R:)
E + (L: True R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:106: AssertionError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: None R:)'
E AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E - (L: None R:)
E ? -
E + (L:None None R:)
E ? +++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
> assert var_5 == 'binary:(L: True R:)'
E AssertionError: assert 'binary:(L:None True R:)' == 'binary:(L: True R:)'
E - binary:(L: True R:)
E + binary:(L:None True R:)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
var_8 = var_3.__repr__()
> assert var_8 == '(L: False R:(L: True R:))'
E AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E - (L: False R:(L: True R:))
E + (L:None False R:(L:None True R:))
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
> assert var_4 == '(L:(L: False R:) False R:)'
E AssertionError: assert '(L: False R:)' == '(L:(L: False R:) False R:)'
E - (L:(L: False R:) False R:)
E + (L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
> assert var_2 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:None False R:)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
> assert var_3 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:None False R:)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L:No...ne False R:))' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:(L:None -2656 R:(L:None False R:))
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L: 1656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 20 failed, 75 passed in 0.47s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 7
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -63,7 +63,7 @@
rightS = ''
if self.left:
leftS = str(self.left)
- if self.right:
+ if not self.right:
rightS = str(self.right)
return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .F.F.....F......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......FFF.............. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...F.......F..F........ [ 89%]
.F...F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________
def test_case_1():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: None R:)'
E AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E - (L: None R:)
E + (L: None R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: None R:)'
E AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E - (L: None R:)
E + (L: None R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E + binary:(L:(L: False R:None) False R:None)
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L: False R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L: False R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E AssertionError: assert 'binary:(L: False R:)' == 'binary:(L: F...R:) True R:))'
E - binary:(L: False R:(L:(L: True R:) True R:))
E + binary:(L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E + binary:(L:(L: False R:None) False R:None)
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L... 3380 R:None)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E ? ----------- -
E + binary:(L:(L: False R:) 3380 R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E AssertionError: assert 'binary:(L: -4493 R:)' == 'binary:(L: -...:) True R:)))'
E - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E + binary:(L: -4493 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
assert binary_node_0.left is None
assert var_0.left is None
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_1.value is False
assert var_1.left is None
assert var_1.right is None
bool_1 = True
binary_tree_0 = module_0.BinaryTree()
var_2 = var_0.addToSubTree(var_0, bool_1)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.value is False
assert var_2.left is None
assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_0.__repr__()
> assert var_3 == '(L: False R:(L: True R:))'
E AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E - (L: False R:(L: True R:))
E + (L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:89: AssertionError
_________________________________ test_case_8 __________________________________
def test_case_8():
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: False R:)'
E AssertionError: assert '(L: False R:None)' == '(L: False R:)'
E - (L: False R:)
E + (L: False R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:97: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
bool_0 = True
binary_node_0 = module_0.BinaryNode(bool_0)
var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
> assert var_1 == '(L:(L: True R:) True R:)'
E AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E - (L:(L: True R:) True R:)
E + (L:(L: True R:None) True R:None)
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:106: AssertionError
_________________________________ test_case_3 __________________________________
def test_case_3():
none_type_0 = None
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_node_0.__repr__()
> assert var_0 == '(L: None R:)'
E AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E - (L: None R:)
E + (L: None R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
> assert var_5 == 'binary:(L: True R:)'
E AssertionError: assert 'binary:(L: True R:None)' == 'binary:(L: True R:)'
E - binary:(L: True R:)
E + binary:(L: True R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
var_8 = var_3.__repr__()
> assert var_8 == '(L: False R:(L: True R:))'
E AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E - (L: False R:(L: True R:))
E + (L: False R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
> assert var_4 == '(L:(L: False R:) False R:)'
E AssertionError: assert '(L:(L: False...False R:None)' == '(L:(L: False R:) False R:)'
E - (L:(L: False R:) False R:)
E + (L:(L: False R:None) False R:None)
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
> assert var_2 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L: False R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
> assert var_3 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L: False R:None)
E ? ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E ? ------------ -
E + binary:(L: -2656 R:)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:(L:(L... 1656 R:None)' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:(L:(L: False R:None) 1656 R:None)
E ? ++++ ++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_1 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_3 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_7 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_8 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_9 - Asserti...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_3 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 20 failed, 75 passed in 0.44s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/AddNot, occurrence: 8
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -69,7 +69,7 @@
def inorder(self):
"""In order traversal generator of tree rooted at given node."""
- if self.left:
+ if not self.left:
for v in self.left.inorder():
yield v
============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.26s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/AddNot, occurrence: 9
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -75,7 +75,7 @@
yield self.value
- if self.right:
+ if not self.right:
for v in self.right.inorder():
yield v
============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 10
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
def add(self, value):
"""Insert value into proper location in Binary Tree."""
- if self.root is None:
+ if not self.root is None:
self.root = BinaryNode(value)
else:
self.root.add(value)============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..F.F...FF..FFF.FF. [ 20%]
FFFFFFFFFFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..........FFFF.FF.F.FF.F [ 57%]
.F..F.. [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .FF.F......F.FFFFFF.FFF [ 89%]
FFFFFFFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:23:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:36:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________
def test_case_8():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
var_1 = binary_tree_0.__repr__()
assert var_1 == 'binary:()'
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:65:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 'binary:()'
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:73:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:93:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:104:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:119:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:140:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:190:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:208:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
> var_3 = binary_tree_0.add(var_2)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:225:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:243:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:265:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:285:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:302:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:318:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:326:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
> var_2 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:344:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 3380
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
> var_2 = binary_tree_0.add(var_1)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:365:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
> var_2 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:383:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = -4493
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_10 _________________________________
def test_case_10():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:110:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:115:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:120:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:125:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:137:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 'binary:()'
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:147:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
> var_0 = binary_tree_0.add(set_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:174:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = {binary:()}
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:181:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
bool_0 = True
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:192:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:203:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.add(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:217:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = binary:()
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:27:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:39:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:55:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_1 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:100:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:121:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:146:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:158:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
> var_1 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:171:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:183:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 'binary:()'
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:197:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:220:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
> var_3 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:244:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:257:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:275:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:293:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_2 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:309:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
> var_3 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:333:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
> var_4 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:365:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
> var_1 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:382:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
> var_0 = binary_tree_0.add(bool_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:408:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = True
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
> var_2 = binary_tree_0.add(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:433:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = False
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
> var_1 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:452:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = -2656
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
> var_2 = binary_tree_0.add(int_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:481:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), value = 1656
def add(self, value):
"""Insert value into proper location in Binary Tree."""
if not self.root is None:
self.root = BinaryNode(value)
else:
> self.root.add(value)
E AttributeError: 'NoneType' object has no attribute 'add'
binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_4 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_8 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_26 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_10 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_11 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_12 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_13 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_16 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_18 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_21 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_23 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_25 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_28 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_1 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 56 failed, 39 passed in 0.83s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 11
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -94,7 +94,7 @@
def remove(self, val):
"""Remove value from tree."""
- if self.root:
+ if not self.root:
self.root = self.root.remove(val)
def getMin(self):============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..F..F...F......FF. [ 20%]
..F..F...F.. [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..............F......... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .....F.....F.F......... [ 89%]
..F.F..... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:20:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________
def test_case_5():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:45:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:70:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:137:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:(L:(L: False R:) False R:)
E ? +++ ++++++++++
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:223:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:282:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E ? +++++++++++ +
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:130:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = binary:()
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________
def test_case_5():
str_0 = 'j_XwI\'J"{^zfX[y'
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.remove(str_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:63:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = 'j_XwI\'J"{^zfX[y'
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = var_0.__repr__()
var_2 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
> assert binary_tree_0.root is None
E assert (L: True R:) is None
E + where (L: True R:) = binary:(L: True R:).root
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
> var_1 = binary_tree_0.remove(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:357:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), val = False
def remove(self, val):
"""Remove value from tree."""
if not self.root:
> self.root = self.root.remove(val)
E AttributeError: 'NoneType' object has no attribute 'remove'
binarySearchTree1.py:98: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_5 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_14 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_5 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_13 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
======================== 14 failed, 81 passed in 0.43s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 12
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
def getMin(self):
"""Returns minimum value."""
- if self.root is None:
+ if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
while n.left != None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ....FF..........F.. [ 20%]
..F..FF..... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ...............FFF...... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ......F....F...F......F [ 89%]
....F..... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:38:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fae34fca560>
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________
def test_case_5():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
with pytest.raises(ValueError):
> binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:47:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:143:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:227:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
assert var_6 == 'binary:(L:(L: False R:) False R:)'
binary_node_0 = module_0.BinaryNode(var_5)
> var_7 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:294:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
> var_3 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:305:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.__iter__()
var_4 = var_3.__repr__()
> var_5 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:142:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: binary:() R:) binary:() R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:149:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fae35291db0>
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:156:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_6 __________________________________
def test_case_6():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:68:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L: True R:)'
> var_6 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:112:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is True
> var_2 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(var_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(var_1)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
object_0 = module_1.object()
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_5 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:264:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: True R:) True R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
var_4 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(var_2)
var_5 = binary_tree_0.add(bool_0)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
var_8 = module_0.BinaryNode(binary_tree_0)
> var_9 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:373:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L:(L: True R:) True R:) True R:)
def getMin(self):
"""Returns minimum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_4 - Va...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_5 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - ValueE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_16 - ValueE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_17 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_6 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Value...
======================== 14 failed, 81 passed in 0.44s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 13
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
- while n.left != None:
+ while not n.left != None:
n = n.left
return n.value
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ....F...........F.. [ 20%]
..F......... [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ................F....... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F...F....... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:38:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fefa791e380>
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:143:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:227:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:149:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fefa7be7e50>
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L: True R:)'
> var_6 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:112:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is True
> var_2 = binary_tree_0.getMin()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMin(self):
"""Returns minimum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.left != None:
E AttributeError: 'NoneType' object has no attribute 'left'
binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_4 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_16 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Attri...
========================= 6 failed, 89 passed in 0.34s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 14
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
def getMax(self):
"""Returns maximum value."""
- if self.root is None:
+ if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
while n.right != None:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ......F.....FFF.FF. [ 20%]
FFFFFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..................FF.... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .......F...F..FFFFF.FF. [ 89%]
FFFFF.FFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________
def test_case_6():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:52:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:95:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:106:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:121:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:145:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:166:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:195:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:213:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:229:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:248:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:270:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:288:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.getMin()
assert var_3 is False
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:307:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:331:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:350:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: True R:)) 3380 R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:370:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:389:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -4493 R:(L: False R:(L: True R:)))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fd412173040>
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:169:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_7 __________________________________
def test_case_7():
binary_tree_0 = module_0.BinaryTree()
var_0 = module_0.BinaryTree()
var_1 = module_0.BinaryTree()
with pytest.raises(ValueError):
> binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:75:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:102:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:148:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:174:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:185:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: binary:() R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:199:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:227:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: 427 R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:246:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:278:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:298:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: True R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:312:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:340:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: 427 R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
var_4 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(var_2)
var_5 = binary_tree_0.add(bool_0)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:369:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: True R:) True R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:414:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:(L: 1625 R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:442:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:(L: 427 R:))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
> var_7 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:463:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
> var_8 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:492:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)
def getMax(self):
"""Returns maximum value."""
if not self.root is None:
> raise ValueError("Binary Tree is empty")
E ValueError: Binary Tree is empty
binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_6 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - V...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_18 - ValueE...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_19 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_7 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Value...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Value...
======================== 37 failed, 58 passed in 0.72s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 15
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
- while n.right != None:
+ while not n.right != None:
n = n.right
return n.value
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ............FFF.FF. [ 20%]
FFFFFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ..................F..... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...........F..FFFFF.FF. [ 89%]
FFFFF.FFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:95:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:106:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:121:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:145:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:166:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
> var_5 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:229:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:288:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(var_0)
var_3 = binary_tree_0.getMin()
assert var_3 is False
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:307:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:) False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:350:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: True R:)) 3380 R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
> assert var_6 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(binary_tree_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:162:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fee9e059390>
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:102:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.closest(var_0)
var_3 = binary_node_0.remove(var_0)
assert binary_node_0.left is None
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is False
assert var_3.left is None
assert var_3.right is None
bool_0 = True
var_4 = var_3.add(bool_0)
assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:148:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.add(bool_0)
var_3 = binary_tree_0.getMax()
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_3 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:185:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: binary:() R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_1 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:199:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: False R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_1.__repr__()
var_5 = binary_tree_0.getMax()
> assert var_5 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_2.left is None
assert var_2.right is None
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:246:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:278:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(binary_node_0)
bool_0 = True
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_node_0.__repr__()
assert var_4 == '(L:(L: False R:) False R:)'
var_5 = binary_tree_0.getMax()
> assert var_5 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
> var_4 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:312:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L: True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
var_2 = binary_tree_0.closest(var_0)
bool_0 = True
var_3 = binary_node_0.addToSubTree(var_2, bool_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert var_3.value is True
assert var_3.left is None
assert var_3.right is None
var_4 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
binary_node_1 = module_0.BinaryNode(var_2)
var_5 = binary_tree_0.add(bool_0)
> var_6 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:369:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: True R:) True R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
> assert var_2 == 1625
E assert True == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
> assert var_6 == 427
E assert False == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
> assert var_7 == 1625
E assert -2656 == 1625
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
> var_8 = binary_tree_0.getMax()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:492:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)
def getMax(self):
"""Returns maximum value."""
if self.root is None:
raise ValueError("Binary Tree is empty")
n = self.root
> while not n.right != None:
E AttributeError: 'NoneType' object has no attribute 'right'
binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_18 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_15 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 34 failed, 61 passed in 0.67s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 16
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -118,7 +118,7 @@
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
- while node:
+ while not node:
if target < node.value :
node = node.left
elif target > node.value:============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..F....F.F..FFF.FF. [ 20%]
FFFFFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F.F. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py FFF.....F.....F.F.FFFFF [ 89%]
FFFFFFFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:21:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_7 __________________________________
def test_case_7():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:57:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:71:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:91:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:102:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:117:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:138:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:160:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:188:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:206:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:221:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:241:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:263:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:283:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:300:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:324:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:341:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:363:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
> var_1 = binary_tree_0.__contains__(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:380:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:186:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:8:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_1 __________________________________
def test_case_1():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:24:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.__contains__(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:34:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_8 __________________________________
def test_case_8():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:79:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:130:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:168:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:209:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:216:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:234:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:252:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:270:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:286:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:304:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:326:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:354:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:429:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:449:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.__contains__(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:476:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def __contains__(self, target):
"""Check whether BST contains target value."""
node = self.root
while not node:
> if target < node.value :
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:122: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_7 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_22 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_1 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_8 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_19 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Attri...
======================== 42 failed, 53 passed in 0.78s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 17
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
"""Check whether BST contains target value."""
node = self.root
while node:
- if target < node.value :
+ if not target < node.value :
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...F.FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py .................FF.... [ 89%]
.......FF. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.getMax()
assert var_3 == 'binary:()'
var_4 = binary_tree_0.__iter__()
var_5 = binary_tree_0.__contains__(var_1)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
======================== 17 failed, 78 passed in 0.44s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 18
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
Return value closest to target. If there are several, then
return one of them.
"""
- if self.root is None:
+ if not self.root is None:
return None
best = node = self.root============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .......F....FF..F.. [ 20%]
FFFFF..FFFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py .......................F [ 57%]
F...... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..F.F....F.F..F...F..FF [ 89%]
F.FFFFF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________
def test_case_7():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:56:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.closest(var_2)
> assert var_3 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
assert var_3 is True
var_4 = binary_tree_0.closest(var_2)
> assert var_4 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:187:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:205:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:240:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:262:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:317:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:323:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:340:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:362:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:379:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
bool_0 = True
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.closest(bool_0)
> assert var_1 is True
E assert None is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:195: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:199:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = binary:()
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:36:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________
def test_case_4():
binary_tree_0 = module_0.BinaryTree()
bool_0 = False
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.closest(bool_0)
> assert var_1 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
float_0 = 1747.362
dict_0 = {float_0: float_0}
binary_tree_0 = module_0.BinaryTree()
> var_0 = binary_tree_0.closest(dict_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:87:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = {1747.362: 1747.362}
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
> var_0 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:97:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_node_0.add(var_0)
assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
> var_2 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:135:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
assert var_2 is True
var_3 = binary_tree_0.closest(bool_0)
> assert var_3 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(none_type_0)
> var_1 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:237:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:254:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:272:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> var_1 = binary_tree_0.closest(none_type_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:306:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = None
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
var_10 = binary_tree_0.closest(var_0)
> assert var_10 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
binary_node_0 = module_0.BinaryNode(var_0)
var_1 = binary_tree_0.remove(var_0)
> var_2 = binary_tree_0.closest(var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:358:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:(), target = False
def closest(self, target):
"""
Return value closest to target. If there are several, then
return one of them.
"""
if not self.root is None:
return None
best = node = self.root
> distance = abs(self.root.value - target)
E AttributeError: 'NoneType' object has no attribute 'value'
binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
> assert var_8 == 427
E assert None == 427
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
assert var_6 is True
var_7 = var_4.remove(var_2)
var_8 = binary_tree_0.closest(var_6)
> assert var_8 is True
E assert None is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert None is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_7 - At...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_26 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_23 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_24 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_4 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_9 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - Attri...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 32 failed, 63 passed in 0.65s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 19
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -138,7 +138,7 @@
best = node = self.root
distance = abs(self.root.value - target)
- while node:
+ while not node:
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
...FF.....FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
...F.FF.FF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
> assert var_7 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__contains__(var_0)
var_2 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(var_2)
assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
var_3 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_2.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.remove(bool_0)
var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_9 = var_6.__repr__()
assert var_9 == '427'
var_10 = binary_tree_0.closest(var_0)
> assert var_10 is False
E assert 427 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
assert var_7 is True
var_8 = binary_tree_0.closest(int_0)
assert var_8 == 427
bool_1 = True
var_9 = binary_tree_0.add(bool_1)
var_10 = var_6.closest(bool_1)
> assert var_10 is True
E assert 427 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
assert var_6 is True
var_7 = var_4.remove(var_2)
var_8 = binary_tree_0.closest(var_6)
> assert var_8 is True
E assert 1625 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
assert var_12 is True
var_13 = var_10.remove(var_8)
var_14 = binary_tree_0.closest(var_0)
> assert var_14 is False
E assert 1656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
========================= 9 failed, 86 passed in 0.37s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/AddNot, occurrence: 20
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
best = node = self.root
distance = abs(self.root.value - target)
while node:
- if abs(node.value - target) < distance:
+ if not abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
if target < node.value:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 21
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
if abs(node.value - target) < distance:
distance = abs(node.value - target)
best = node
- if target < node.value:
+ if not target < node.value:
node = node.left
elif target > node.value:
node = node.right============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%]
..FFF.....FF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%]
..F.....F. [100%]
=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = -201
var_7 = binary_tree_0.closest(int_0)
> assert var_7 is False
E assert -201 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
> assert var_7 is True
E assert -4493 is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_2 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMax()
assert var_4 is True
var_5 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = var_4.__repr__()
var_8 = binary_tree_0.closest(var_0)
> assert var_8 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
assert var_10 is True
var_11 = var_9.remove(var_7)
var_12 = binary_tree_0.closest(var_0)
> assert var_12 is False
E assert -2656 is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
========================= 7 failed, 88 passed in 0.32s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 22
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -153,7 +153,7 @@
def __iter__(self):
"""In order traversal of elements in the tree."""
- if self.root:
+ if not self.root:
for e in self.root.inorder():
yield e
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ...............F... [ 20%]
............ [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%]
..F.... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ...................F... [ 89%]
.......... [100%]
=================================== FAILURES ===================================
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(none_type_0)
> object_0 = module_1.object(*var_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:132:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def __iter__(self):
"""In order traversal of elements in the tree."""
if not self.root:
> for e in self.root.inorder():
E AttributeError: 'NoneType' object has no attribute 'inorder'
binarySearchTree1.py:157: AttributeError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
> object_0 = module_1.object(*binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:208:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def __iter__(self):
"""In order traversal of elements in the tree."""
if not self.root:
> for e in self.root.inorder():
E AttributeError: 'NoneType' object has no attribute 'inorder'
binarySearchTree1.py:157: AttributeError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
> object_0 = module_1.object(*binary_tree_0)
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:211:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = binary:()
def __iter__(self):
"""In order traversal of elements in the tree."""
if not self.root:
> for e in self.root.inorder():
E AttributeError: 'NoneType' object has no attribute 'inorder'
binarySearchTree1.py:157: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_15 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_26 - Attrib...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_19 - Attri...
========================= 3 failed, 92 passed in 0.29s =========================
worker outcome: normal
test outcome: killed
operator: core/AddNot, occurrence: 23
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
yield e
def __repr__(self):
- if self.root is None:
+ if not self.root is None:
return "binary:()"
return "binary:" + str(self.root)
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ........FF......FF. [ 20%]
...F.F...F.F [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ...............F........ [ 57%]
...F... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..........FF.....F..... [ 89%]
.....F.FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________
def test_case_8():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
var_1 = binary_tree_0.__repr__()
> assert var_1 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
assert var_6 is True
int_0 = 451
var_7 = binary_tree_0.closest(int_0)
assert var_7 is False
var_8 = var_2.__repr__()
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
assert var_2 is True
var_3 = binary_tree_0.getMax()
assert var_3 is False
var_4 = var_1.__repr__()
var_5 = binary_tree_0.__contains__(var_2)
assert var_5 is False
var_6 = binary_tree_0.add(var_5)
var_7 = binary_tree_0.remove(var_3)
var_8 = binary_tree_0.__repr__()
> assert var_8 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
assert var_3 is True
var_4 = binary_tree_0.add(var_3)
var_5 = binary_tree_0.getMax()
assert var_5 is True
var_6 = binary_tree_0.closest(var_5)
assert var_6 is True
var_7 = var_2.__repr__()
var_8 = binary_tree_0.add(var_6)
var_9 = binary_tree_0.__repr__()
> assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E - binary:(L: False R:(L:(L: True R:) True R:))
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.getMax()
assert var_4 is False
var_5 = var_3.__repr__()
var_6 = binary_tree_0.__repr__()
> assert var_6 == 'binary:(L:(L: False R:) False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E - binary:(L:(L: False R:) False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 == 3380
var_7 = binary_tree_0.closest(var_6)
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = binary_tree_0.remove(var_7)
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
assert var_4 is True
var_5 = binary_tree_0.add(var_4)
var_6 = binary_tree_0.getMax()
assert var_6 is True
var_7 = binary_tree_0.closest(var_6)
assert var_7 is True
var_8 = var_3.__repr__()
var_9 = binary_tree_0.add(var_7)
var_10 = module_1.object()
var_11 = binary_tree_0.__repr__()
> assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_15 _________________________________
def test_case_15():
binary_tree_0 = module_0.BinaryTree()
binary_tree_1 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:136: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:213: AssertionError
_________________________________ test_case_10 _________________________________
def test_case_10():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________
def test_case_11():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.closest(none_type_0)
bool_0 = True
binary_node_0 = module_0.BinaryNode(none_type_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is True
var_3 = binary_tree_0.remove(bool_0)
assert binary_tree_0.root is None
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = binary_tree_0.__repr__()
> assert var_5 == 'binary:(L: True R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E - binary:(L: True R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
> assert var_0 == 'binary:()'
E AssertionError: assert 'binary:None' == 'binary:()'
E - binary:()
E + binary:None
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
> assert var_2 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
> assert var_3 == 'binary:(L: False R:)'
E AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E - binary:(L: False R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E - binary:(L: -2656 R:(L: False R:))
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
> assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E - binary:(L:(L: False R:) 1656 R:)
E + binary:()
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_8 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - As...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - A...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_15 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_27 - Assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_10 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_11 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - Asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - Asser...
======================== 17 failed, 78 passed in 0.41s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceTrueWithFalse, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -124,7 +124,7 @@
elif target > node.value:
node = node.right
else:
- return True
+ return False
return False
============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py .............FF.FF. [ 20%]
FFFFF...FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ....................F... [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ..................F.... [ 89%]
.....FFFFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 is False
var_3 = binary_tree_0.__contains__(var_2)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = var_1.__repr__()
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__contains__(var_0)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.remove(binary_tree_0)
var_2 = binary_tree_0.__contains__(var_1)
var_3 = binary_tree_0.add(var_2)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = binary_tree_0.getMin()
assert var_4 is False
var_5 = binary_tree_0.getMax()
assert var_5 is False
binary_tree_1 = module_0.BinaryTree()
var_6 = binary_tree_0.__contains__(var_5)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = 3380
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
var_2 = binary_tree_0.add(var_1)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__contains__(var_1)
> assert var_3 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
assert var_1 is False
int_0 = -4493
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_1)
var_4 = binary_tree_0.__contains__(var_1)
> assert var_4 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
set_0 = {binary_tree_0}
var_0 = binary_tree_0.add(set_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.__contains__(set_0)
> assert var_1 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________
def test_case_18():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
bool_0 = False
binary_node_0 = module_0.BinaryNode(none_type_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_1 = binary_tree_0.getMax()
assert var_1 is False
var_2 = binary_tree_0.__contains__(var_1)
> assert var_2 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__iter__()
bool_0 = False
binary_node_0 = module_0.BinaryNode(bool_0)
var_1 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.__repr__()
assert var_2 == 'binary:(L: False R:)'
int_0 = 427
var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_4 = var_0.__repr__()
var_5 = binary_tree_0.remove(bool_0)
var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_7 = binary_tree_0.__contains__(bool_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
bool_0 = True
binary_node_0 = module_0.BinaryNode(binary_tree_0)
var_0 = binary_tree_0.add(bool_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
int_0 = 1625
var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_2 = binary_tree_0.getMax()
assert var_2 == 1625
var_3 = binary_tree_0.remove(bool_0)
var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_4.add(var_2)
var_6 = binary_tree_0.__contains__(bool_0)
> assert var_6 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
var_1 = binary_tree_0.__iter__()
binary_node_0 = module_0.BinaryNode(var_0)
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.__repr__()
assert var_3 == 'binary:(L: False R:)'
int_0 = 427
var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_5 = var_1.__repr__()
var_6 = binary_tree_0.getMax()
assert var_6 == 427
var_7 = binary_tree_0.__contains__(int_0)
> assert var_7 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
int_0 = -2656
var_1 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
bool_0 = False
var_2 = var_0.__repr__()
binary_node_0 = module_0.BinaryNode(var_0)
var_3 = binary_tree_0.add(bool_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
int_1 = 1625
var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_6 = var_0.__repr__()
var_7 = binary_tree_0.getMax()
assert var_7 == 1625
var_8 = binary_tree_0.remove(bool_0)
var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_10 = binary_tree_0.__contains__(bool_0)
> assert var_10 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
assert var_0 is False
bool_0 = True
var_1 = var_0.__repr__()
int_0 = 1656
var_2 = binary_tree_0.add(int_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.add(var_0)
var_4 = binary_tree_0.__repr__()
assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
binary_node_0 = module_0.BinaryNode(var_0)
var_5 = binary_tree_0.__repr__()
assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
int_1 = 1625
var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
var_7 = var_0.__repr__()
var_8 = binary_tree_0.getMax()
assert var_8 == 1656
var_9 = binary_tree_0.remove(bool_0)
var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
var_11 = var_10.add(var_8)
var_12 = binary_tree_0.__contains__(bool_0)
> assert var_12 is True
E assert False is True
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_20 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_18 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_28 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_29 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 20 failed, 75 passed in 0.44s =========================
worker outcome: normal
test outcome: killed
operator: core/ReplaceFalseWithTrue, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -126,7 +126,7 @@
else:
return True
- return False
+ return True
def closest(self, target):
"""============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 95 items
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ..F....F.F..FFF.FF. [ 20%]
FFFFFFF.FFFF [ 32%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ......................F. [ 57%]
....... [ 65%]
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py FFF.....F.....F.FF.FFFF [ 89%]
FFFFF..FFF [100%]
=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:22: AssertionError
_________________________________ test_case_7 __________________________________
def test_case_7():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(binary_tree_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________
def test_case_9():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:72: AssertionError
_________________________________ test_case_12 _________________________________
def test_case_12():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:92: AssertionError
_________________________________ test_case_13 _________________________________
def test_case_13():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:103: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:118: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:139: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:161: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:189: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:207: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:222: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:242: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:264: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.remove(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:284: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:301: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:325: AssertionError
_________________________________ test_case_28 _________________________________
def test_case_28():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:342: AssertionError
_________________________________ test_case_29 _________________________________
def test_case_29():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:364: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.closest(binary_tree_0)
var_1 = binary_tree_0.__contains__(var_0)
> assert var_1 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py:381: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py:187: AssertionError
_________________________________ test_case_0 __________________________________
def test_case_0():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:9: AssertionError
_________________________________ test_case_1 __________________________________
def test_case_1():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:25: AssertionError
_________________________________ test_case_2 __________________________________
def test_case_2():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(none_type_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:35: AssertionError
_________________________________ test_case_8 __________________________________
def test_case_8():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:80: AssertionError
_________________________________ test_case_14 _________________________________
def test_case_14():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:131: AssertionError
_________________________________ test_case_16 _________________________________
def test_case_16():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:169: AssertionError
_________________________________ test_case_17 _________________________________
def test_case_17():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__repr__()
assert var_0 == 'binary:()'
var_1 = var_0.__repr__()
assert var_1 == "'binary:()'"
var_2 = binary_tree_0.add(var_0)
assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
var_3 = binary_tree_0.getMax()
assert var_3 == 'binary:()'
var_4 = binary_tree_0.__iter__()
var_5 = binary_tree_0.__contains__(var_1)
> assert var_5 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_19 _________________________________
def test_case_19():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:210: AssertionError
_________________________________ test_case_20 _________________________________
def test_case_20():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:217: AssertionError
_________________________________ test_case_21 _________________________________
def test_case_21():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:235: AssertionError
_________________________________ test_case_22 _________________________________
def test_case_22():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:253: AssertionError
_________________________________ test_case_23 _________________________________
def test_case_23():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________
def test_case_24():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:287: AssertionError
_________________________________ test_case_25 _________________________________
def test_case_25():
binary_tree_0 = module_0.BinaryTree()
none_type_0 = None
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:305: AssertionError
_________________________________ test_case_26 _________________________________
def test_case_26():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:327: AssertionError
_________________________________ test_case_27 _________________________________
def test_case_27():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:355: AssertionError
_________________________________ test_case_30 _________________________________
def test_case_30():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:430: AssertionError
_________________________________ test_case_31 _________________________________
def test_case_31():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:450: AssertionError
_________________________________ test_case_32 _________________________________
def test_case_32():
binary_tree_0 = module_0.BinaryTree()
var_0 = binary_tree_0.__contains__(binary_tree_0)
> assert var_0 is False
E assert True is False
DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py:477: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_2 - as...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_7 - as...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_9 - as...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_12 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_13 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_14 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_16 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_17 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_19 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_20 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_21 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_22 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_23 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_24 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_25 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_27 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_28 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_29 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py::test_case_30 - a...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py::test_case_22 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_0 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_1 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_2 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_8 - assert...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_14 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_16 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_17 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_19 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_20 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_21 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_22 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_23 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_24 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_25 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_26 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_27 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_30 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_31 - asser...
FAILED DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py::test_case_32 - asser...
======================== 39 failed, 56 passed in 0.60s =========================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ZeroIterationForLoop, occurrence: 0
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -70,7 +70,7 @@
def inorder(self):
"""In order traversal generator of tree rooted at given node."""
if self.left:
- for v in self.left.inorder():
+ for v in []:
yield v
yield self.value============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ZeroIterationForLoop, occurrence: 1
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -76,7 +76,7 @@
yield self.value
if self.right:
- for v in self.right.inorder():
+ for v in []:
yield v
class BinaryTree:============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.25s ==============================
SURVIVED
worker outcome: normal
test outcome: survived
operator: core/ZeroIterationForLoop, occurrence: 2
--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -154,7 +154,7 @@
def __iter__(self):
"""In order traversal of elements in the tree."""
if self.root:
- for e in self.root.inorder():
+ for e in []:
yield e
def __repr__(self):============================= test session starts ============================== platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0 rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1 collected 95 items DYNAMOSA-MIO-MOSA/test_binarySearchTree1_DYNAMOSA.py ................... [ 20%] ............ [ 32%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MIO.py ........................ [ 57%] ....... [ 65%] DYNAMOSA-MIO-MOSA/test_binarySearchTree1_MOSA.py ....................... [ 89%] .......... [100%] ============================== 95 passed in 0.24s ==============================